type crypto/x509.policyGraphNode

28 uses

	crypto/x509 (current package)
		verify.go#L1043: type policyGraphNode struct {
		verify.go#L1048: 	parents  map[*policyGraphNode]bool
		verify.go#L1049: 	children map[*policyGraphNode]bool
		verify.go#L1052: func newPolicyGraphNode(valid OID, parents []*policyGraphNode) *policyGraphNode {
		verify.go#L1053: 	n := &policyGraphNode{
		verify.go#L1056: 		children:          map[*policyGraphNode]bool{},
		verify.go#L1057: 		parents:           map[*policyGraphNode]bool{},
		verify.go#L1067: 	strata []map[string]*policyGraphNode
		verify.go#L1069: 	parentIndex map[string][]*policyGraphNode
		verify.go#L1076: 	root := policyGraphNode{
		verify.go#L1079: 		children:          map[*policyGraphNode]bool{},
		verify.go#L1080: 		parents:           map[*policyGraphNode]bool{},
		verify.go#L1084: 		strata: []map[string]*policyGraphNode{{string(anyPolicyOID.der): &root}},
		verify.go#L1088: func (pg *policyGraph) insert(n *policyGraphNode) {
		verify.go#L1092: func (pg *policyGraph) parentsWithExpected(expected OID) []*policyGraphNode {
		verify.go#L1099: func (pg *policyGraph) parentWithAnyPolicy() *policyGraphNode {
		verify.go#L1106: func (pg *policyGraph) parents() iter.Seq[*policyGraphNode] {
		verify.go#L1113: func (pg *policyGraph) leaves() map[string]*policyGraphNode {
		verify.go#L1117: func (pg *policyGraph) leafWithPolicy(policy OID) *policyGraphNode {
		verify.go#L1135: func (pg *policyGraph) validPolicyNodes() []*policyGraphNode {
		verify.go#L1136: 	var validNodes []*policyGraphNode
		verify.go#L1169: 	pg.parentIndex = map[string][]*policyGraphNode{}
		verify.go#L1177: 	pg.strata = append(pg.strata, map[string]*policyGraphNode{})
		verify.go#L1253: 						parents = []*policyGraphNode{anyParent}
		verify.go#L1267: 				missing := map[string][]*policyGraphNode{}
		verify.go#L1313: 							n := newPolicyGraphNode(OID{der: []byte(issuerStr)}, []*policyGraphNode{matching})
		verify.go#L1361: 	var validPolicyNodeSet []*policyGraphNode